Two - Level Meta - Reasoning in Coq ? Amy
نویسنده
چکیده
منابع مشابه
Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq
The use of higher-order abstract syntax is an important approach for the representation of binding constructs in encodings of languages and logics in a logical framework. Formal meta-reasoning about such object languages is a particular challenge. We present a mechanism for such reasoning, formalized in Coq, inspired by the Hybrid tool in Isabelle. At the base level, we define a de Bruijn repre...
متن کاملSecond International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
Logical frameworks supporting higher-order abstract syntax (HOAS) allow a direct and concise specification of a wide variety of languages and deductive systems. Reasoning about such systems within the same framework is well-known to be problematic. We describe the new version of the Hybrid system, implemented on top of Isabelle/HOL (as well as Coq), in which a de Bruijn representation of λ-term...
متن کاملTwo-Level Hybrid: A System for Reasoning Using Higher-Order Abstract Syntax
Logical frameworks supporting higher-order abstract syntax (HOAS) allow a direct and concise specification of a wide variety of languages and deductive systems. Reasoning about such systems within the same framework is well-known to be problematic. We describe the new version of the Hybrid system, implemented on top of Isabelle/HOL (as well as Coq), in which a de Bruijn representation of λ-term...
متن کاملMachine - Assisted Meta - Theory of Sequent - StyleCalculi
A formalisation of the implicational fragments of two sequent calculi and a sequent-style presentation of natural deduction in Coq is presented. The systems presented are all typed lambda calculi. Based on this formalisation, some general comments on the feasibility of performing meta-theoretic proofs about typed lambda calculi in a proof assistant based on higher-order type theory are made. Co...
متن کاملFormalizing Simple Refinement Types in Coq An Experience Report
We consider refinement types in which base types can be refined by constraints expressible in some decidable logic. Such refinement types have been applied in many settings, such as certification of security policies [1, 10], and reasoning precisely about heap updates [9, 10]. A lot of work has been done on extensions of the basic idea of refinements, including inference in liquid types [8], or...
متن کامل